PARAMETRIZED EIGHT-VERTEX MODEL AND KNOT INVARIANT
نویسندگان
چکیده
The article discusses and expands the known elements of eight-vertex model, paying special attention to parameterization matrix. matrix values are interconnected with knot through braids this model is valid on finite square lattices in two-dimensional space. A new solution parametrized free fermions a complex version elliptic functions, which lattice, will be constructed. range applicability Jacobi function construction invariant its basis discussed by comparing results obtained analytically for model. using Clebsch-Gordan coefficients main tool statistical mechanics Yang-Baxter equation studied detail
منابع مشابه
Analytic theory of the eight-vertex model
We observe that the exactly solved eight-vertex solid-on-solid model contains an hitherto unnoticed arbitrary field parameter, similar to the horizontal field in the six-vertex model. The parameter is required to describe a continuous spectrum of the unrestricted solid-onsolid model, which has an infinite-dimensional space of states even for a finite lattice. The introduction of the continuous ...
متن کامل3 The odd eight - vertex model
We consider a vertex model on the simple-quartic lattice defined by line graphs on the lattice for which there is always an odd number of lines incident at a vertex. This is the odd 8-vertex model which has eight possible vertex configurations. We establish that the odd 8-vertex model is equivalent to a staggered 8-vertex model. Using this equivalence we deduce the solution of the odd 8-vertex ...
متن کاملThe Eight Vertex Model. New results
Whereas the tools to determine the eigenvalues of the eight-vertex transfer matrix T are well known there has been until recently incomplete knowledge about the eigenvectors of T . We describe the construction of eigenvectors of T corresponding to degenerate eigenvalues and discuss the related hidden elliptic symmetry.
متن کاملComplexity Classification of the Eight-Vertex Model
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or #P-hard. The dichotomy criterion is explicit. For tractability, we find some new classes of problems computable in polynomial time. For #P-hardness, we employ Möbius transformations to prove ...
متن کاملThe parametrized complexity of knot polynomials
We study the parametrized complexity of the knot (and link) polynomials known as Jones polynomials, Kauuman polynomials and Hommy-polynomials. It is known that computing these polynomials is ]P hard in general. We look for parameters of the combinatorial presentation of knots and links which make the computation of these polynomials to be xed parameter tractable, i.e. to be in FPT. If the link ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eurasian physical technical journal
سال: 2022
ISSN: ['1811-1165', '2413-2179']
DOI: https://doi.org/10.31489/2022no1/119-126